SMASH: Structured matrix approximation by separation and hierarchy
نویسندگان
چکیده
منابع مشابه
Tensor Low Multilinear Rank Approximation by Structured Matrix Low-Rank Approximation
We present a new connection between higherorder tensors and affinely structured matrices, in the context of low-rank approximation. In particular, we show that the tensor low multilinear rank approximation problem can be reformulated as a structured matrix low-rank approximation, the latter being an extensively studied and well understood problem. We first consider symmetric tensors. Although t...
متن کاملToeplitz and Hankel matrix approximation using structured approach
structures on a model based on available prior informaAlgorithms are presented for least-squares approximation. Earlier work on these problems has primarily contion of Toeplitz and Hankel matrices from noise corsisted of using Singular Value Decomposition [4, 5, 81, rupted or ill-composed matrices, which may not have where only the rank information of the underlying sigcorrect structural or ran...
متن کاملStructured Low Rank Approximation of a Bezout Matrix
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given Bezout matrix a new Bezout matrix of lower rank whose entries are near the corresponding entries of that input matrix. We present an algorithm based on a version of structured nonlinear total least squares (SNTLS) meth...
متن کاملStructured Low Rank Approximation of a Sylvester Matrix
The task of determining the approximate greatest common divisor (GCD) of univariate polynomials with inexact coefficients can be formulated as computing for a given Sylvester matrix a new Sylvester matrix of lower rank whose entries are near the corresponding entries of that input matrix. We solve the approximate GCD problem by a new method based on structured total least norm (STLN) algorithms...
متن کاملStructured Methods for Solving Hankel Matrix Approximation Problems
The problem of finding the nearest positive semidefinite Hankel matrix of a given rank to an arbitrary matrix is considered. The problem is formulated as a nonlinear minimization problem with positive semidefinite Hankel matrix as constraints. Then an algorithm with rapid convergence is obtained by the Sequential Quadratic Programming (SQP) method. A second approach is to formulate the problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Linear Algebra with Applications
سال: 2018
ISSN: 1070-5325,1099-1506
DOI: 10.1002/nla.2204